How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?

A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in the message forwarding problem in a message-switched network in which the system resources must be managed in order to deliver messages to any processor of the network. To this end, we use the information provided by a routing algorithm. In the context of an arbitrary initialization (due to stabilization), this informationmay be corrupted. In Cournier et al. (2009) [1], we show that there exist snap-stabilizing algorithms for this problem (in the state model). This implies thatwe can request the system to begin forwardingmessageswithout losses even if routing information is initially corrupted. In this paper, we propose another snap-stabilizing algorithm for this problem which improves the space complexity of the one in Cournier et al. (2009) [1]. © 2010 Elsevier B.V. All rights reserved.